Unified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transforms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transforms

The problems of unified efficient computations of the discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), and their inverse transforms are considered. In particular, a new scheme employing the time-recursive approach to compute these transforms is presented. Using such approach, unified parallel lattice structures that can dually generate the DCT an...

متن کامل

Block Time-Recursive Real-Valued Discrete Gabor Transform Implemented by Unified Parallel Lattice Structures

In this paper, the 1-D real-valued discrete Gabor transform (RDGT) proposed in our previous work and its relationship with the complex-valued discrete Gabor transform (CDGT) are briefly reviewed. Block time-recursive RDGT algorithms for the efficient and fast computation of the 1-D RDGT coefficients and for the fast reconstruction of the original signal from the coefficients are then developed ...

متن کامل

Parallel-recursive filter structures for the computation of discrete transforms

A general approach is presented for implementing discrete transforms as a set of rst-order or second-order recursive digital lters. Clenshaw's recurrence formulae are used to formulate the second-order lters. The resulting structure is suitable for e cient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the discrete Legendre transform as an ill...

متن کامل

Parallel lattice structure of block time-recursive generalized Gabor transforms

The problems of eecient computation of generalized Gabor transforms are considered in this work. Block time-recursive Gabor transforms are deened for both complex and real data sequences, fast algorithms are derived through two diierent approaches, one by the nite Zak transform, the other by biorthogonal functions. All the block time-recursive algorithms for the computation of generalized Ga-bo...

متن کامل

Optimal unified architectures for the real-time computation of time-recursive discrete sinusoidal transforms

An optimal unified architecture that can efficiently compute the Discrete Cosine, Sine, Hartley, Fourier, Lapped Orthogonal, and Complex Lapped transforms for a continuous stream of input data that arise in signallimage communications is proposed. This structure uses only half as many multipliers as the previous best known scheme [l]. The proposed architecture is regular, modular, and has only ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 1993

ISSN: 1053-587X,1941-0476

DOI: 10.1109/78.205735